Timed Mobile Ambients for Network Protocols

نویسندگان

  • Bogdan Aman
  • Gabriel Ciobanu
چکیده

Ambient calculus is a calculus for mobile computing able to express local communications inside hierarchical domains. So far the timing properties have not been considered in the framework of mobile ambients. We add timers to capabilities and ambients, and provide an operational semantics of the new calculus. Certain results are related to the passage of time, and some new behavioural equivalences over timed mobile ambients are defined. Timeout for network communication (TTL) can be naturally modelled by the time constraints over capabilities and ambients. The new formalism can be used to describe network protocols; Simple Network Management Protocol (SNMP) may implement its own strategy for timeout and retransmission in TCP/IP.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Calculus of Virtually Timed Ambients

A virtual machine, which is a software layer representing an execution environment, can be placed inside another virtual machine. As virtual machines at every level in a location hierarchy compete with other processes for processing time, the computing power of a virtual machine depends on its position in this hierarchy and may change if the virtual machine moves. These effects of nested virtua...

متن کامل

Abstract Machines for Safe Ambients in Wide-Area and Mobile Networks

Machines for Safe Ambients in Wide-Area and Mobile Networks Seiji Umatani, Masahiro Yasugi, and Taiichi Yuasa Graduate School of Informatics, Kyoto University, Sakyo-ku Kyoto 606-8501, Japan {umatani,yasugi,yuasa}@kuis.kyoto-u.ac.jp Abstract. Recently, there have been several studies focusing on the imRecently, there have been several studies focusing on the implementation of process calculi wi...

متن کامل

Secure Routing Protocol: Affection on MANETs Performance

In mobile ad hoc networks, the absence ofinfrastructure and the consequent absence of authorizationfacilities impede the usual practice of establishing a practicalcriterion to distinguishing nodes as trusted and distrusted.Since all nodes in the MANETs would be used as router inmulti-hop applications, secure routing protocols have vital rulein the security of the network. So evaluating the perf...

متن کامل

Probabilistic Mobile Ambients

The calculus of Mobile Ambients has been introduced for expressing mobility and mobile computation. In this paper we present a probabilistic version of Mobile Ambients by augmenting the syntax of the original Ambient Calculus with a (guarded) probabilistic choice operator. To allow for the representation of both the probabilistic behaviour introduced through the new probabilistic choice operato...

متن کامل

Multi-agent Reactive Systems

We present a formalism for programming complex multiagent reactive systems in a structured manner. The motivation behind this work is to obtain a simple semantic framework for such reactive systems. The approach followed is to build upon a timed extension of concurrent constraint programs that have been used to present an elegant declarative framework for reactive systems. Timed concurrent cons...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008